翻訳と辞書 Words near each other ・ Heteronym (literature) ・ Heteronympha ・ Heteronympha banksii ・ Heteronympha merope ・ Heteronyx queenlandicus ・ Heteroousianism ・ Heteropacha ・ Heteropalpia ・ Heteropalpia acrosticta ・ Heteropalpia profesta ・ Heteropalpoides aberrans ・ Heterogeneous Earliest Finish Time ・ Heterogeneous Element Processor ・ Heterogeneous network ・ Heterogeneous nuclear ribonucleoprotein A1 ・ Heterogeneous random walk in one dimension ・ Heterogeneous ribonucleoprotein particle ・ Heterogeneous System Architecture ・ Heterogeneous water oxidation ・ Heterogeneous wireless network ・ Heteroglenea ・ Heteroglossia ・ Heteroglycan alpha-mannosyltransferase ・ Heterogobius chiloensis ・ Heterogony of ends ・ Heterogram ・ Heterogram (linguistics) ・ Heterogram (literature) ・ Heterogramma ・ Heterograph Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Heterogeneous random walk in one dimension ： ウィキペディア英語版 Heterogeneous random walk in one dimension In studies of dynamics, probability, physics, chemistry and related fields, a heterogeneous random walk in one dimension is a random walk in a one dimensional interval with jumping rules that depend on the location of the random walker in the interval. For example: say that the time is discrete and also the interval. Namely, the random walker jumps every time step either left or right. A possible heterogeneous random walk draws in each time step a random number that determines the local jumping probabilities and then a random number that determines the actual jump direction. Specifically, say that the interval has 9 sites (labeled 1 through 9), and the sites (also termed states) are connected with each other linearly (where the edges sites are connected their adjacent sites and together). In each time step, the jump probabilities (from the actual site) are determined when flipping a coin; for head we set: probability jumping left =1/3, where for tail we set: probability jumping left = 0.55. Then, a random number is drawn from a uniform distribution: when the random number is smaller than probability jumping left, the jump is for the left, otherwise, the jump is for the right. Usually, in such a system, we are interested in the probability of staying in each of the various sites after ''t'' jumps, and in the limit of this probability when ''t'' is very large, $t\backslash rightarrow\backslash infty$. Generally, the time in such processes can also vary in a continuous way, and the interval is also either discrete or continuous. Moreover, the interval is either finite or without bounds. In a discrete system, the connections are among adjacent states. The basic dynamics are either Markovian, semi-Markovian, or even not Markovian depending on the model. In discrete systems, heterogeneous random walks in 1d have jump probabilities that depend on the location in the system, and/or different jumping time (JT) probability density functions (PDFs) that depend on the location in the system. General solutions for heterogeneous random walks in 1d obey equations ()-(), presented in what follows. ==Introduction== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Heterogeneous random walk in one dimension」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.